E ciently Scanning All Spanning Trees of an Undirected Graph
نویسندگان
چکیده
Let G be an undirected graph with V vertices and E edges. We consider the problem of enumerating all spanning trees of G: In order to explicitly output all spanning trees, the output size is of (NV ), where N is the number of spanning trees. This, however, can be compressed into (N) size. In this paper, we propose a new algorithm for enumerating all spanning trees of G in such compact form. The time and space complexities of our algorithm are O(N + V + E) and O(V E), respectively. The algorithm is optimal in the sense of time complexity.
منابع مشابه
Providing a Simple Method for the Calculation of the Source and Target Reliabili- ty in a Communication Network (SAT)
The source and target reliability in SAT network is de- fined as the flawless transmission from the source node to all the other nodes. In some references, the SAT pro- cess has been followed between all the node pairs but it is very time-consuming in today’s widespread networks and involves many costs. In this article, a method has been proposed to compare the reliability in complex networks b...
متن کاملProviding a Simple Method for the Calculation of the Source and Target Reliabili- ty in a Communication Network (SAT)
The source and target reliability in SAT network is de- fined as the flawless transmission from the source node to all the other nodes. In some references, the SAT pro- cess has been followed between all the node pairs but it is very time-consuming in today’s widespread networks and involves many costs. In this article, a method has been proposed to compare the reliability in complex networks b...
متن کاملOn relation between the Kirchhoff index and number of spanning trees of graph
Let $G=(V,E)$, $V={1,2,ldots,n}$, $E={e_1,e_2,ldots,e_m}$,be a simple connected graph, with sequence of vertex degrees$Delta =d_1geq d_2geqcdotsgeq d_n=delta >0$ and Laplacian eigenvalues$mu_1geq mu_2geqcdotsgeqmu_{n-1}>mu_n=0$. Denote by $Kf(G)=nsum_{i=1}^{n-1}frac{1}{mu_i}$ and $t=t(G)=frac 1n prod_{i=1}^{n-1} mu_i$ the Kirchhoff index and number of spanning tree...
متن کاملAn Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs
Let G be an undirected graph with V vertices and E edges. Many algorithms have been developed for enumerating all spanning trees in G. Most of the early algorithms use a technique called `backtracking'. Recently, several algorithms using a di erent technique have been proposed by Kapoor and Ramesh (1992), Matsui (1993), and Shioura and Tamura (1993). They nd a new spanning tree by exchanging on...
متن کاملAn Algorithm for Finding All the Spanning Trees in Undirected Graphs
In this paper, we propose an algorithm for nding all the spanning trees in undirected graphs. The algorithm requires O(n +m + n) time and O(n +m) space, where the given graph has n vertices, m edges and spanning trees. For outputting all the spanning trees explicitly, this algorithm is optimal.
متن کامل